Statistical analysis on random quantum circuit sampling by Sycamore and Zuchongzhi quantum processors
نویسندگان
چکیده
Random quantum sampling, a task to sample bit-strings from random circuit, is considered one of suitable benchmark tasks demonstrate the outperformance computers even with noisy qubits. Recently, sampling was performed on Sycamore processor 53 qubits [Nature 574, 505 (2019)] and Zuchongzhi 56 [Phys. Rev. Lett. 127, 180501 (2021)]. Here, we analyze compare statistical properties outputs by Zuchongzhi. Using Marchenko-Pastur law Wasssertein distances, find that more closer classical uniform than those Sycamore. Some Zuchongzhi's pass number tests while both show similar patterns in heatmaps bit-strings. It shown samples change little as depth circuits increases. Our findings raise question about computational reliability processors could produce statistically different for same task.
منابع مشابه
Quantum Supremacy and the Complexity of Random Circuit Sampling
A critical milestone on the path to useful quantum computers is quantum supremacy – a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading near-term candidate, put forth by the Google/UCSB team, is sampling from the probability distributions of randomly chosen quantum circuits, which we call Random Circuit Sampling (RCS). In this paper we study bo...
متن کاملDesigning and analyzing the quantum efficiency model based on quantum immaterial skills through thematic analysis
The aim of this study was to identify the components of productivity based on intangible quantum skills and provide a model of quantum productivity. This research is fundamental and applied in terms of purpose, which has been done by analytical, exploratory and field methods. The statistical population of the present study was professors and experts in the field of sports management and manager...
متن کاملOn Statistical Query Sampling and NMR Quantum Computing
We introduce a “Statistical Query Sampling” model, in which the goal of an algorithm is to produce an element in a hidden set S ⊆ {0, 1}n with reasonable probability. The algorithm gains information about S through oracle calls (statistical queries), where the algorithm submits a query function g(·) and receives an approximation to Prx∈S [g(x) = 1]. We show how this model is related to NMR quan...
متن کاملConductance in quantum wires by three quantum dots arrays
A noninteracting quantum-dot arrays side coupled to a quantum wire is studied. Transport through the quantum wire is investigated by using a noninteracting Anderson tunneling Hamiltonian. The conductance at zero temperature develops an oscillating band with resonances and antiresonances due to constructive and destructive interference in the ballistic channel, respectively. Moreover, we have fo...
متن کاملQuantum Statistical Testing of a Quantum Random Number Generator
The unobservable elements in a quantum technology, e.g., the quantum state, complicate system verification against promised behavior. Using model-based system engineering, we present methods for verifying the operation of a prototypical quantum random number generator. We begin with the algorithmic design of the QRNG followed by the synthesis of its physical design requirements. We next discuss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2022
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physreva.106.032433